| 2001 | Stasys Jukna: Extremal Combinatorics: With Applications in Computer Science. Springer-Verlag, 2001 |
|---|
| 1999 | Stasys Jukna: Combinatorics of monotone computations. In: Combinatorica, 1999, 65-85 |
|---|
| 1999 | Stasys Jukna: Linear codes are hard for oblivious read-once parity branching programs. In: Information Processing Letters, 1999, 267-269 |
|---|
| 1999 | Stasys Jukna, Alexander Razborov, Petr Savicky, Ingo Wegener, On P versus NP intersected with co-NP for decision trees and read-once branching programs. In: Computational Complexity, 1999, 357-370 |
|---|
| 1998 | Stasys Jukna: Exponential lower bounds for semantic resolution
. In: Paul Beame, Samuel Buss, DIMACS Series in discrete mathematics and theoretical computer science. American Mathematical Society, 1998. 163-172 |
|---|
| 1998 | Stasys Jukna, Alexander Razborov: Neither reading few bits twice nor reading illegally helps much. In: Discrete Applied Mathematics, 1998, 223-238 |
|---|
| 1998 | Carsten Damm, Stasys Jukna, Jiri Sgal: Some bounds on multiparty communication complexity of pointer jumping. In: Computational Complexity, 1998, 109-127 |
|---|
| 1995 | Stasys Jukna: A note on read-k times branching programs. In: RAIRO Theoretical Informatics and Applications, 1995, 75-83 |
|---|
| 1995 | Stasys Jukna: Computing threshold functions by depth-3 threshold circuits with smaller thresholds of their gates. In: Information Processing Letters, 1995, 147-150 |
|---|
| 1995 | Johan Hastad, Stasys Jukna, Pavel Pudlak: Top-down lower bounds for depth-three circuits. In: Computational Complexity, 1995, 99-112 |
|---|
